Dynamics of Genre and Domain Intents.

What can quantum theory bring to information retrieval.

Filtering Documents with Subspaces.

A user behavior model for average precision and its generalization to graded judgments.

Exploring a Multidimensional Representation of Documents and Queries %28extended version%29

Movie Recommender Semantically Enriched Unified Relevance Model for Rating Prediction in Collaborative Filtering.

A Quantum%2DBased Model for Interactive Information Retrieval.


Structured Information Retrieval and Quantum Theory.


Evaluation Metrics for Structured Text Retrieval.
Indexing units refers to the granularity of information in the retrieval system’s index, which can be in principle any document part of a structured text, and as a consequence determines the possible units of retrieval. There are three basic approaches: The first approach is to index every potentially retrievable unit as a whole—the so-called element-based approach [13]. The second approach is to index disjoint nodes—and relying on aggregation or score propagation methods for scoring higher-level nodes [e.g., 1, 12]. The third approach is to index only selected elements, for example by indexing particular element types in separate indexes [10]. Various mixtures of these approaches have also been applied. All approaches make implicit or explicit assumptions on the (most likely) unit of retrieval. Although there may be no designated retrieval unit (such as the document or root node of the structured document), this also does not mean that every document part (such as a sub-tree of the structured document) is an equally desirable retrieval unit. Such assumptions may be relatively generic (such as paragraphs and sections being more informative than very short excerpts in bold or italics) or may depend on the query at hand (such as a structured query requesting elements with a particular tag). In all cases these assumptions depend on the sort of structured documents (which may range from strict XML databases to loosely structured textual documents with mark-up), and on the sort of information need (which may range from a strict database query with well defined semantics to a vague
Specificity.
 
A Quantum%2Dbased Model for Interactive Information Retrieval %28extended version%29

Introduction to the special issue on Graphical Models and Information Retrieval.

A user browsing model to predict search engine click data from past observations.

Sound and complete relevance assessment for XML retrieval.
In information retrieval research, comparing retrieval approaches requires test collections consisting of documents, user requests and relevance assessments. Obtaining relevance assessments that are as sound and complete as possible is crucial for the comparison of retrieval approaches. In XML retrieval, the problem of obtaining sound and complete relevance assessments is further complicated by the structural relationships between retrieval results. A major difference between XML retrieval and flat document retrieval is that the relevance of elements (the retrievable units) is not independent of that of related elements. This has major consequences for the gathering of relevance assessments. This paper describes investigations into the creation of sound and complete relevance assessments for the evaluation of content-oriented XML retrieval as carried out at INEX, the evaluation campaign for XML retrieval. The campaign, now in its seventh year, has had three substantially different approaches to gather assessments and has finally settled on a highlighting method for marking relevant passages within documents – even though the objective is to collect assessments at element level. The different methods of gathering assessments at INEX are discussed and contrasted. The highlighting method is shown to be the most reliable of the methods. Categories and Subject Descriptors:
Taking advantage of the Semantics of a Lesson Graph based on Learning Objects.

Predictive user click models based on click%2Dthrough history.

Enhancing Educational%2DMaterial Retrieval Using Authored%2DLesson Metadata.

Precision recall with user modeling %28PRUM%29 Application to structured information retrieval.



INEX 2006 Evaluation Measures.
Abstract. This paper describes the official measures of retrieval effectiveness employed at the ad hoc track of INEX 2006. 1
Evaluation in %28XML%29 information retrieval expected precision%2Drecall with user modelling %28EPRUM%29.

Principal Components for Automatic Term Hierarchy Building.

A Statistical Model of Query Log Generation.

Principal Components for Automatic Term Hierarchy Building.

Discovering a Term Taxonomy from Term Similarities Using Principal Component Analysis.
Abstract. We show that eigenvector decomposition can be used to extract a term taxonomy from a given collection of text documents. So far, methods based on eigenvector decomposition, such as latent semantic indexing (LSI) or principal component analysis (PCA), were only known to be useful for extracting symmetric relations between terms. We give a precise mathematical criterion for distinguishing between four kinds of relations of a given pair of terms of a given collection: unrelated (car-fruit), symmetrically related (car- automobile), asymmetrically related with the first term being more specific than the second (banana- fruit), and asymmetrically related in the other direction (fruit- banana). We give theoretical evidence for the soundness of our criterion, by showing that in a simplified mathematical model the criterion does the apparently right thing. We applied our scheme to the reconstruction of a selected part of the open directory project (ODP) hierarchy, with promising results.
EPRUM Metrics and INEX 2005.

A Bayesian Framework for XML Information Retrieval Searching and Learning with the INEX Collection.

Providing consistent and exhaustive relevance assessments for XML retrieval evaluation.

Interface pour l%27%E9valuation de syst%E8mes de recherche sur des documents XML.

An Algebra for Structured Queries in Bayesian Networks.

An Algebra for Probabilistic XML Retrieval.

A Machine Learning Model for Information Retrieval with Structured Documents.

Bayesian Networks and INEX.
We present a bayesian framework for XML document retrieval. This framework allows us to consider content only and structure and content queries. We perform the retrieval task using inference in our network. Our model can adapt to a specific corpora through parameter learning.
